Inductive inference from all positive and some negative data

Inductive Inference from all Positive and Some Negative Data

Inductive Inference of an Approximate Concept from Positive Data

In ordinary learning paradigm, a target concept, whose examples are fed to an inference machine, is assumed to belong to a hypothesis space which is given in advance. However this assumption is not appropriate, if we want an inference machine to infer or to discover an unknown rule which explains examples or data obtained from scientific experiments. In their previous paper, Mukouchi and Arikaw...

Inductive inference from theory laden data

Inductive Inference of Prolog Programs with Linear Data Dependency from Positive Data

We study inductive inference of Prolog programs from positive examples of a target predicate. Shinohara showed in 1991 that the class of linear Prologs with at most m clauses is identi able in the limit from positive data only about a target predicate. However, linear Prologs are not allowed to have local variables, which are variables occurring in the body but not in the head. In this paper, w...

Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data

Tree structured data such as HTML/XML files are represented by rooted trees with ordered children and edge labels. As a representation of a tree structured pattern in such tree structured data, we propose an ordered tree pattern, called a term tree, which is a rooted tree pattern consisting of ordered children and internal structured variables. A term tree is a generalization of standard tree p...